Optimality conditions for a nonconvex set-valued optimization problem
نویسندگان
چکیده
منابع مشابه
Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
Unfortunately, the incorrect version of [1, Theorem 4.3] was published. The correct version of [1, Theorem 4.3] is given in this paper. By employing the generalized higher-order contingent derivatives of set-valued maps, Wang et al. [1] established a sufficient optimality condition of weakly efficient solutions for (SV P): (SV P) min F(x), s.t. G(x) (−D) = ∅, x ∈ E. Theorem 1 (see [1, Theorem 4...
متن کاملOptimality Conditions for Vector Optimization with Set-Valued Maps
In this paper, we establish a Farkas-Minkowski type alternative theorem under the supposition of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we present necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization problems with extended inequality constraints in a sense of weak E-minimizers.
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملGlobal and local optimality conditions in set-valued optimization problems
Through the paper, X and Y are normed vector spaces; however, most of the results remain true in the more general setting of locally convex spaces. We denote by X∗ and Y∗ the topological dual spaces of X and Y . We consider a pointed closed convex cone Q ⊂ Y which introduces a partial order on Y by the equivalence y1 ≤Q y2 ⇔ y2 − y1 ∈Q; we also suppose, in general, that Q has nonempty interior....
متن کاملFirst-order optimality conditions in set-valued optimization
A a set-valued optimization problem minC F (x), x ∈ X0, is considered, where X0 ⊂ X , X and Y are Banach spaces, F : X0 Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x, y), y ∈ F (x), and are called minimizers. In particular the notions ofw-minimizer (weakly efficient points), p-minimizer (properly efficient points) and i-mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2008
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.11.035